the reverse degree distance of a connected graph $g$ is defined in discrete mathematical chemistry as [ r (g)=2(n-1)md-sum_{uin v(g)}d_g(u)d_g(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $g$, respectively, $d_g(u)$ is the degree of vertex $u$, $d_g(u)$ is the sum of distance between vertex $u$ and all other vertices of $g$, and $v(g)$ is the ...

The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...

let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...

The reverse degree distance of a connected graph G is defined in discrete mathematical chemistry as D(G) = 2(n− 1)md− ∑

Astigmatism’s defect has not yet been formulated in Physics and medical physics books theoretically. In this paper, we are trying to formulate the astigmatism’s defect. The results of formulation show that “the degree of astigmatism is negative reverse the distance that vision’s condition of astigmatism’s chart lines change conditions in dimness angle from dimness condition at infinite distance...

Astigmatism’s defect has not yet been formulated in Physics and medical physics books theoretically. In this paper, we are trying to formulate the astigmatism’s defect. The results of formulation show that “the degree of astigmatism is negative reverse the distance that vision’s condition of astigmatism’s chart lines change conditions in dimness angle from dimness condition at infinite distance...

astigmatism’s defect has not yet been formulated in physics and medical physics books theoretically. in this paper, we are trying to formulate the astigmatism’s defect. the results of formulation show that “the degree of astigmatism is negative reverse the distance that vision’s condition of astigmatism’s chart lines change conditions in dimness angle from dimness condition at infinite distance...

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.